problem with fixed endpoints

См. также в других словарях:

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

• Kepler problem in general relativity — The Kepler problem in general relativity involves solving for the motion of two spherical bodies interacting with one another by gravitation, as described by the theory of general relativity.Typically, and in this article, one body is assumed to… …   Wikipedia

• Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …   Wikipedia

• Brouwer fixed point theorem — In mathematics, the Brouwer fixed point theorem is an important fixed point theorem that applies to finite dimensional spaces and which forms the basis for several general fixed point theorems. It is named after Dutch mathematician L. E. J.… …   Wikipedia

• Céa's lemma — is a lemma in mathematics. It is an important tool for proving error estimates for the finite element method applied to elliptic partial differential equations. Contents 1 Lemma statement 2 Error estimate in the energy norm 3 …   Wikipedia

• Wave equation — Not to be confused with Wave function. The wave equation is an important second order linear partial differential equation for the description of waves – as they occur in physics – such as sound waves, light waves and water waves. It arises in… …   Wikipedia

• Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… …   Wikipedia

• analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… …   Universalium

• nature, philosophy of — Introduction       the discipline that investigates substantive issues regarding the actual features of nature as a reality. The discussion here is divided into two parts: the philosophy of physics and the philosophy of biology.       In this… …   Universalium

• Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia